Abstract Projecting a high dimensional feature into a low- dimensional feature without compromising the feature
نویسنده
چکیده
Projecting a high dimensional feature into a lowdimensional feature without compromising the feature characteristic is a challenging task. This paper proposes a novel dimensionality reduction constituted from the integration of extreme learning machine (ELM) and spectral regression (SR). The ELM in the proposed method is built on the structure of the unsupervised ELM. The hidden layer weights are determined randomly while the output weight is calculated using the spectral regression. The flexibility of the SR that can take labels into consideration leads a new supervised dimensionality reduction called SRELM. Generally speaking, SRELM is an unsupervised system in term of ELM yet it is a supervised system in term of dimensionality reduction. In this paper, SRELM is implemented in the finger movement classification based on electromyography signals from two channels. The experimental results show that the SRELM can enhance the performance of its predecessor, spectral regression linear discriminant analysis (SRDA) because it has better class separability than SRDA. In addition, its performance is better than principal component analysis (PCA) and comparable to uncorrelated linear discriminant analysis (ULDA).
منابع مشابه
Feature Selection for Small Sample Sets with High Dimensional Data Using Heuristic Hybrid Approach
Feature selection can significantly be decisive when analyzing high dimensional data, especially with a small number of samples. Feature extraction methods do not have decent performance in these conditions. With small sample sets and high dimensional data, exploring a large search space and learning from insufficient samples becomes extremely hard. As a result, neural networks and clustering a...
متن کاملSupervised Feature Extraction of Face Images for Improvement of Recognition Accuracy
Dimensionality reduction methods transform or select a low dimensional feature space to efficiently represent the original high dimensional feature space of data. Feature reduction techniques are an important step in many pattern recognition problems in different fields especially in analyzing of high dimensional data. Hyperspectral images are acquired by remote sensors and human face images ar...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملAn Improved Flower Pollination Algorithm with AdaBoost Algorithm for Feature Selection in Text Documents Classification
In recent years, production of text documents has seen an exponential growth, which is the reason why their proper classification seems necessary for better access. One of the main problems of classifying text documents is working in high-dimensional feature space. Feature Selection (FS) is one of the ways to reduce the number of text attributes. So, working with a great bulk of the feature spa...
متن کاملیک روش مبتنی بر خوشهبندی سلسلهمراتبی تقسیمکننده جهت شاخصگذاری اطلاعات تصویری
It is conventional to use multi-dimensional indexing structures to accelerate search operations in content-based image retrieval systems. Many efforts have been done in order to develop multi-dimensional indexing structures so far. In most practical applications of image retrieval, high-dimensional feature vectors are required, but current multi-dimensional indexing structures lose their effici...
متن کامل